1797A - Li Hua and Maze - CodeForces Solution


constructive algorithms flows graphs greedy implementation *800

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define lli long long int
using namespace std;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool valid(int x,int y,int n,int m){
    if(x<1 or y<1 or x>n or y>m) return false;
    return true;
}
int func(int x,int y,int n,int m){
    int cnt=0;
    for(int i=0;i<4;i++){
        if(valid(x+dx[i],y+dy[i],n,m)) cnt++;
    }
    return cnt;
}
void solve(){
    int n,m;
    cin>>n>>m;
    int x1,y1,x2,y2;
    cin>>x1>>y1>>x2>>y2;
    cout<<min(func(x1,y1,n,m),func(x2,y2,n,m))<<endl; 
}
    
int main(){
    int t=1;
    cin>>t;
    while(t--){
        solve();

    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)